A Simple and Efficient Algorithm for Detection of High Curvature Points in Planar Curves
نویسنده
چکیده
A new algorithm is proposed for detection of corners and other high curvature points in planar curves. A corner is deened as a location where a triangle with speciied opening angle and size can be inscribed in the curve. The tests compare the new algorithm to four alternative algorithms for corner detection.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملMidcourse Trajectory Shaping for Air and Ballistic Defence Guidance Using Bezier Curves
A near-optimal midcourse trajectory shaping guidance algorithm is proposed for both air and ballistic target engagement mission attributes for generic long range interceptor missile. This guidance methodology is based on the maximum final velocity as the objective function and maximum permissible flight altitude as the in-flight state constraint as well as the head-on orientation as the termina...
متن کاملCorner detection based on gradient correlation matrices of planar curves
An efficient and novel technique is developed for detecting and localizing corners of planar curves. This paper discusses the gradient feature distribution of planar curves and constructs gradient correlation matrices (GCMs) over the region of support (ROS) of these planar curves. It is shown that the eigenstructure and determinant of the GCMs encode the geometric features of these curves, such...
متن کاملCapturing outlines of planar images using Bézier cubics
A technique has been designed for capturing outlines by exploiting the properties of cubic Bezier curves. The planar images are used to extract the outline. The outline is divided into curve segments at high curvature points and each segment is processed independently for piecewise curve approximation. The proposed algorithm avoids the traditional method of least square fitting which is time co...
متن کاملA Simple Algorithm for Efficient Piecewise Linear Approximation of Space Curves
An on-line method for piecewise linear approximation of open or closed space curves is described. The algorithm guarantees approximation within a deviation threshold and is offered as an efficient, on-line alternative to the split and merge approach. Other efficient methods operate only on planar curves, whereas the approach we offer is also appropriate for space curves. A simple function of ch...
متن کامل